Combinatorial two-stage minmax regret problems under interval uncertainty
نویسندگان
چکیده
منابع مشابه
Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. Existing minmax regret models consider only deterministic solutions/strategies, and minmax regret...
متن کاملMinmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
This paper deals with a general combinatorial optimization problem in which closed intervals and fuzzy intervals model uncertain element weights. The notion of a deviation interval is introduced, which allows us to characterize the optimality and the robustness of solutions and elements. The problem of computing deviation intervals is addressed and some new complexity results in this field are ...
متن کاملMinmax regret combinatorial optimization problems: an Algorithmic Perspective
Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90’s and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust d...
متن کاملSome tractable instances of interval data minmax regret problems
In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well known solvable instances. Tractable cases occur when the parameter is bounded by a constant.
متن کاملMinmax regret solutions for minimax optimization problems with uncertainty
We propose a general approach for nding minmax regret solutions for a class of combinatorial optimization problems with an objective function of minimax type and uncertain objective function coe cients. The approach is based on reducing a problem with uncertainty to a number of problems without uncertainty. The method is illustrated on bottleneck combinatorial optimization problems, minimax mul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2020
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-020-03863-7